asynchronous computability

asynchronous computability
вычислимость в асинхронной среде
многопользовательские и многопроцессорные системы в принципе асинхронны, поэтому для их эффективной работы необходимы средства координации, гарантирующие отсутствие взаимоблокировок и бесконечных (длительных) периодов ожидания для асинхронно выполняемых процессов
см. тж. non-blocking synchronization, synchronization primitive

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Нужно сделать НИР?

Смотреть что такое "asynchronous computability" в других словарях:

  • Consensus (computer science) — Consensus is a problem in distributed computing that encapsulates the task of group agreement in the presence of faults.[1] In particular, any process in the group may fail at any time. Consensus is fundamental to core techniques in fault… …   Wikipedia

  • Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

  • Counter — This article is about the term counter used in electronics and computing. For other uses, see Counter (disambiguation). In digital logic and computing, a counter is a device which stores (and sometimes displays) the number of times a particular… …   Wikipedia

  • Distributed computing — is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal …   Wikipedia

  • Process calculus — In computer science, the process calculi (or process algebras) are a diverse family of related approaches to formally modelling concurrent systems. Process calculi provide a tool for the high level description of interactions, communications, and …   Wikipedia

  • Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

  • Cellular automaton — A cellular automaton (plural: cellular automata) is a discrete model studied in computability theory, mathematics, theoretical biology and microstructure modeling. It consists of a regular grid of cells , each in one of a finite number of states …   Wikipedia

  • Billiard-ball computer — [ Fredkin and Toffoli Gate Billiard Ball Model] A billiard ball computer as in ref|penr is an idealized model of a computing machine based on Newtonian dynamics. Instead of using electronic signals like a conventional computer, it relies on the… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»